BOUNDS ON INVERSE DOMINATION IN SQUARES OF GRAPHS
نویسندگان
چکیده
منابع مشابه
Bounds on the Inverse Signed Total Domination Numbers in Graphs
Abstract. Let G = (V,E) be a simple graph. A function f : V → {−1, 1} is called an inverse signed total dominating function if the sum of its function values over any open neighborhood is at most zero. The inverse signed total domination number of G, denoted by γ0 st(G), equals to the maximum weight of an inverse signed total dominating function of G. In this paper, we establish upper bounds on...
متن کاملBounds on Global Total Domination in Graphs
A subset S of vertices in a graph G is a global total dominating set, or just GTDS, if S is a total dominating set of both G and G. The global total domination number γgt(G) of G is the minimum cardinality of a GTDS of G. We present bounds for the global total domination number in graphs.
متن کاملBounds on neighborhood total domination in graphs
In this paper, we continue the study of neighborhood total domination in graphs first studied by Arumugam and Sivagnanam [S. Arumugam, C. Sivagnanam, Neighborhood total domination in graphs, Opuscula Math. 31 (2011) 519–531]. A neighborhood total dominating set, abbreviated NTD-set, in a graph G is a dominating set S in G with the property that the subgraph induced by the open neighborhood of t...
متن کاملInverse and Disjoint Restrained Domination in Graphs
Let D be a minimum secure restrained dominating set of a graph G = (V, E). If V – D contains a restrained dominating set D' of G, then D' is called an inverse restrained dominating set with respect to D. The inverse restrained domination number γr(G) of G is the minimum cardinality of an inverse restrained dominating set of G. The disjoint restrained domination number γrγr(G) of G is the minimu...
متن کاملGraphs with Constant Sum of Domination and Inverse Domination Numbers
A subsetD of the vertex set of a graph G, is a dominating set if every vertex in V −D is adjacent to at least one vertex inD. The domination number γ G is the minimum cardinality of a dominating set of G. A subset of V −D, which is also a dominating set of G is called an inverse dominating set of G with respect toD. The inverse domination number γ ′ G is the minimum cardinality of the inverse d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Research in Engineering and Technology
سال: 2013
ISSN: 2321-7308,2319-1163
DOI: 10.15623/ijret.2013.0210086